Beyond Hyper-Heuristics: A Squared Hyper-Heuristic Model for Solving Job Shop Scheduling Problems

نویسندگان

چکیده

Hyper-heuristics (HHs) stand as a relatively recent approach to solving optimization problems. There are different kinds of HHs. One them deals with how low-level heuristics must be combined deliver an improved solution set problem instances. Literature commonly refers selection hyper-heuristics . their advantages is that the strengths each heuristic can fused into high-level solver. However, one drawbacks sometimes this generalization scheme does not suffice. Additionally, it easy reuse these HHs since model cannot easily tweaked. So, in work, we develop hyper-heuristic additional layer generalization. The rationale behind preserve general structure selecting adequate solver for particular situation but use instead heuristics. We call Squared Hyper-Heuristic (SHH). To validate our proposal, pursue four-stage methodology covers several testing scenarios. Our data reveal that, under proper conditions, outperform base Moreover, flexible enough allow increased number layers so complexity final tuned. instances used train stage model, thus setting groundwork developing transfer learning hyper-heuristics.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling

We describe a new hyper-heuristic method NELLI-GP for solving job-shop scheduling problems (JSSP) that evolves an ensemble of heuristics. The ensemble adopts a divide-and-conquer approach in which each heuristic solves a unique subset of the instance set considered. NELLI-GP extends an existing ensemble method called NELLI by introducing a novel heuristic generator that evolves heuristics compo...

متن کامل

Heuristic Methods for Solving Job-Shop Scheduling Problems

Solving scheduling problems with Constraint Satisfaction Problems (CSP’s) techniques implies a wide space search with a large number of variables, each one of them with a wide interpretation domain. This paper discusses the application of CSP heuristic techniques (based on the concept of slack of activities) for variable and value ordering on a special type of job-shop scheduling problems in wh...

متن کامل

Genetic Programming Based Hyper-heuristics for Dynamic Job Shop Scheduling: Cooperative Coevolutionary Approaches

Job shop scheduling (JSS) problems are optimisation problems that have been studied extensively due to their computational complexity and application in manufacturing systems. This paper focuses on a dynamic JSS problem to minimise the total weighted tardiness. In dynamic JSS, jobs’ attributes are only revealed after they arrive at the shop floor. Dispatching rule heuristics are prominent appro...

متن کامل

Reference Point Adaption Method for Genetic Programming Hyper-Heuristic in Many-Objective Job Shop Scheduling

Job Shop Scheduling is an important combinatorial optimisation problem in practice. It usually contains many (four or more) potentially conflicting objectives such as makespan and mean weighted tardiness. On the other hand, evolving dispatching rules using genetic programming has demonstrated to be a promising approach to solving job shop scheduling due to its flexibility and scalability. In th...

متن کامل

A unified hyper-heuristic framework for solving bin packing problems

One-and two-dimensional packing and cutting problems occur in many commercial contexts, and it is often important to be able to get good-quality solutions quickly. Fairly simple deterministic heuristics are often used for this purpose, but such heuristics typically find excellent solutions for some problems and only mediocre ones for others. Trying several different heuristics on a problem adds...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2022

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2022.3169503